Method for automatically generating chain stitches

ABSTRACT

The present invention is an improved method for automatically generating chain stitching in a computer aided design system in which the shape to be filled is a complex polygon. The Voronoi Diagram of the polygon is determined, concentric polygons are then constructed and sorted and the chain stitches are placed on the perimeter of the concentric polygons. The chain stitches can be used to completely fill a stitch pattern, such as an embroidery stitch pattern, or in conjunction with other stitching, such as Chenille stitching in an embroidery pattern.

CROSS-REFERENCE TO RELATED APPLICATIONS

This is a continuation-in-part application of commonly owned U.S. patent application Ser. No. 08/323,156 filed Oct. 14, 1994, now U.S. Pat. No. 5,510,994, and is related to our commonly owned, U.S. patent application Ser. No. 08/323,157, now U.S. Pat. No. 5,506,784, and to our commonly owned, U.S. patent application Ser. No. 08/526,157, now U.S. Pat. No. 5,541,847, the contents of which are incorporated herein by reference in their entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to methods for automatically generating filled embroidery patterns in a computer aided design system, and more particularly to an improved method for automatically generating chain stitches in a computer aided design system.

2. Description of the Related Art

Computer aided design systems for controlling embroidery machines are well known in the art. Such systems allow the user to select embroidery patterns to be stitched either through a stored series of designs or creation of original designs, such as described in our previously issued U.S. Pat. No. 5,430,658, entitled "Method for Creating Self-Generating Embroidery Pattern", and our previously issued U.S. Pat. No. 5,343,401, entitled "Embroidery Design System". In such prior art systems, embroidery patterns may typically be generated in an outline form of a particular shape such as a letter or an animal, or may be filled in with stitches. It is also known in the art to be able to modify the embroidery design programs used in such computer aided design systems so that the user may independently vary and modify a large variety of characteristics of an existing embroidery design program including, such as described in our previously issued U.S. Pat. No. 5,270,939.

In addition, chenille type embroidery machines capable of providing chenille type stitching, which produces a towel like effect in the embroidery pattern, are also well known, such as disclosed, by way of example, in U.S. Pat. No. 5,056,444. A typical conventional chenille type embroidery machine is manufactured by Tajima Industries Ltd. of Japan. As noted in U.S. Pat. No. 5,056,444, which describes a prior art chenille type embroidery machine, chenille type embroidery machines provide a fuzzy appearance of a pattern, for example, such as on an athletic award or letter, with the fuzzy appearance being formed by the use of a hooked needle which, in combination with a looper, which wraps thread around the needle (as illustrated in FIGS. 1A-1E), pulls a thread through a piece of material. Such a stitch is known as a "moss" stitch and is performed by the looper looping thread over the hook of the needle below the material to be embroidered. The needle then pulls the looped thread through and above the material. Another device known as the X/Y drive then pulls the material away from the raised needle causing the looped thread to slip off the hook. The needle again penetrates the material and the process is repeated, resulting in a fuzzy patterned item.

By reversing the hook of the needle so that the looped thread remains on the hook after the X/Y movement of the material, a chain stitch can be formed. In such an instance, the X/Y drive pulls the material and the thread as in the above described prior art moss stitch procedure, but now the thread remains on the hook as the needle re-penetrates the material and a linked chain stitch is formed, such as illustrated in FIGS. 2A-2E. Chain stitching is generally used to follow the perimeter of a shape. Chenille stitching may be used to create a cross hatch or lattice chenille, such as illustrated in FIG. 3, or a spiral type chenille. In a lattice chenille, the pattern that is created by the loop stitch in order to fill a shape, has the stitching starting at one point in the shape and moving in straight lines diagonally covering the area, whereas in a spiral type chenille, in order to fill the shape the stitching is performed in a spiral fashion causing the embroidery machine to place stitches at many varying angles to provide a random/hand-done appearance.

Chenille stitching in the past was generally performed by hand which is a very tedious, time consuming task, and did not utilize the advantages of a computer aided design system which could allow the operator to make decisions on how the coverage would take place. Prior to applicants' invention, spiral coverage for chenille stitches was not automatically generated, but, rather, was accomplished either by hand or manually entered in the computer. Moreover, where the pattern was a complex polygon, there were difficulties in the prior art in trying to place chain stitching around a complex polygon. Thus, applicants are not aware of any efficient prior art computer aided design systems for generating filled embroidery patterns which enable chenille filled embroidery patterns, or chain stitches, to be automatically generated and this is so despite the wide spread use of computer aided design systems for controlling embroidery machines.

SUMMARY OF THE INVENTION

In a method for automatically generating chain stitched stitch patterns in a computer aided design system capable of generating stitch patterns, the improvement comprises automatically generating a chain stitched stitch pattern by selecting an associated polygon type shape, determining a Voronoi Diagram for that shape, constructing a plurality of concentric polygon shapes extending from the Voronoi Diagram to the outer edge of the selected polygon shape, sorting the constructed concentric polygon shapes for proper sequencing and minimal jumping of the selected pattern from one part to another, and placing the chain stitches on the perimeter of the concentric polygons. Chain stitching is provided around the selected polygon shape for covering a filled embroidery pattern with chain stitches, with the chain stitches being placed on the perimeter of the constructed concentric polygon shapes at a predetermined length. The improved method of automatically generating chain stitches may be used to completely fill the selected polygon shape. It should be noted that as used herein, the term "polygon" is not meant to be limited to a shape having only straight line segments, but is meant to include edges that are not straight lines, such as parabolic curves as well.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1A-1E are diagrammatic illustrations of a typical prior art method of providing a chenille stitch with a loop or moss stitch;

FIGS. 2A-2E are diagrammatic illustrations of a typical prior art method of providing a chain stitch;

FIG. 3 is a diagrammatic illustration of a typical cross hatch or lattice chenille;

FIGS. 4A & B are diagrammatic illustration of a computer generated spiral type chenille;

FIG. 5 is a diagrammatic illustration of a design made entirely by placing chain stitches to cover the area in accordance with the preferred method of the present invention;

FIGS. 6A-6C are diagrammatic illustrations of a typical polygonal approximation procedure in accordance with the preferred method of the present invention;

FIGS. 7A-7C are is a system flow diagrams of the presently preferred method of automatically generating a spiral type chenille in accordance with the present invention; and

FIGS. 8A-8C are system flow diagrams, similar to FIGS. 7A-7C, of the presently preferred method of automatically generating chain stitching in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

Referring to the drawings in detail, and initially to FIGS. 6A-6C, a typical framework for determining the Voronoi Diagram of a polygon shape is illustrated, with the medial axis of the polygon shape being readily obtainable by computing the Voronoi Diagram of the boundary line segments. Such Voronoi medial axes normally consist of segments of straight lines and parabola. This framework is described in "Voronoi diagrams of Polygons: A Framework for Shape Representation", N. Mayya and V. T. Rajan, Proceedings of IEEE VVPR 1994, Seattle, Washington, the content of which is incorporated herein by reference. In addition, the algorithm for analyzing the shape to be filled to determine its medial axis, sometimes referred to as its skeleton, is described in "A transformation for extracting new descriptors of shape", Models for the Perception of Speech and Visual Form (W. Wathen-Dunn, ed.), H. Blum, 1967, Cambridge, Mass.: MIT Press, the content of which is incorporated herein by reference. As noted above, the medial axis of a polygonal shape can be obtained by computing the Voronoi Diagram of the boundary line segments of the polygonal shape, since the medial axis is exactly contained in the set of Voronoi edges of the polygon and is obtained by deleting the two Voronoi edges incident with each concave vertex. Since the Voronoi diagram is merely a superset of the medial axis, with the medial axis being computed therefrom, for purposes of the present invention, the two terms shall be used interchangeably herein except where the relationship between the two must be separately described for clarity of understanding.

In accordance with the preferred method of the invention, a conventional computer aided design system is employed for generating embroidery stitch patterns, such as described in our U.S. Pat. No. 5,343,401, the contents of which are incorporated herein by reference in their entirety, with the computer employed typically being an IBM PC compatible computer running Microsoft Windows, and programmed in the "C" programming language. The method of the present invention adds the capability of automatically generating chenille as well as chain stitching to the embroidery designs which the computer aided design system can generate, and can be used in embroidery or any other concentric coverage of shapes.

As shown and preferred in FIGS. 7A-7C, in accordance with the presently preferred method of the present invention, which may be used for automatically generating spiral type chenille to provide a chenille filled embroidery pattern, first the shape to be filled is analyzed to determine its Voronoi diagram, with the shape to be filled preferably comprising a complex polygon with or without holes.

Computing the Voronoi Diagram involves computing all of the edges that lie inside the polygonal shape and that are equidistant from two of the original polygonal shape's sites, where the sites are either edges or vertices of the shape. The edges are either line segments, when the two sites they are equidistant from are both points, i.e., vertices of the polygonal shape, or both lines, i.e., edges of the polygonal shape; or parabolic edges, when the two sites are equidistant from one point and one line.

In accomplishing this analysis, the computer preferably creates rays emanating in towards the selected polygon shape from every corner of the shape that is less than 90 degrees by constructing a vector that bisects the angle of the corner. For corners of the selected complex polygon shape that have an interior angle that is greater than 90 degrees, preferably two rays are constructed by the computer, each pointing in a direction normal or perpendicular to one of the edges of the corner.

Each ray is then "traced" to find its terminating point, thus completely defining the Voronoi edge. As discussed above, each ray is equidistant from two sites, which are called its parents. The terminating point for that ray is determined by finding the point at which it is equidistant from three sites. The tracing step involves computing, for each site, the point on the ray at which it is equidistant from the parents and from that site. The site with the closest such point from the start point is selected as the final end point of the ray.

For each site, the computer determines the set of Voronoi edges of which the site is a parent. This set of edges, along with the site itself, from a region called the Voronoi region of the site and must be a closed region.

In operation, the computer preferably puts all of the rays in a circular list which is a list in which the last element points back to the first element. While these rays are in the circular list, preferably the computer calls the first element in the list the head and if the head points directly into another ray, the computer then removes the head and the other ray from the list, adds them to a list of final rays, and returns to calling the first element remaining in the list the head and repeats the procedure. The computer then finds an edge in the polygon that forces the head to stop and calls it the closest candidate and then uses the closest candidate and the head to compute all new rays that emanate from the head's endpoint. The new rays are then preferably added to the list, the head is removed and added to the list of final rays, and the entire procedure is repeated for rays remaining in the list, with the process being stopped when the list is empty and all rays have been added to the final list.

Having determined the Voronoi Diagram, preferably the computer creates concentric polygons located between the outer edge of the polygonal shape and the Voronoi Diagram. The distance between the concentric polygons is one of the determinants of the fill. To construct the concentric polygons, for each point site at a non-convex edge, the computer determines a set of parallel parabolic arcs that lie inside the Voronoi region of the point site that are at successive offset of d from each other.

For each line site of the polygonal shape, the computer determines the endpoints of a parallel line segment that is contained inside the Voronoi region and that is at a specified offset distance from the line site. The computer collects a set of such parallel lines, each lying at successive offsets of d from the previous one. The set of offset edges at a given offset from the outer polygonal shape are collected together. This set represents the concentric or offset polygon/region for a given offset. This step is repeated for the edges at every offset level.

It will be appreciated that the concentric or offset polygons/regions include edges that are parabolic curves and are thus not strictly polygons (which generally include only straight edges). Rather, these polygons may more precisely be called closed regions that are at an exact offset distance d from the outermost polygonal shape. Nonetheless, as used herein, these closed regions shall be refereed to as offset or concentric polygons.

In operation, for each edge in the original selected polygon, the computer constructs a new polygon made up of those edges of the Voronoi Diagram that are closest to the edge being considered, sweeps a line through the polygon which has been generated, and computes all the segments of all positions of the line that fall in the interior of the polygon. Once this has been done for all the segments in the polygonal shape, the computer determines for each edge which edges are adjacent to it to construct the concentric polygons. The computer then outputs the list of offset polygons. Thereafter, the computer sorts these concentric polygons in order to allow for proper sequencing and minimal jumping from one part of the shape to another, preferably in order of increasing offset distance d.

In carrying out this sorting, preferably the polygons are sorted to determine which are inside which and, once all the polygons are sorted, they form a tree rooted at the outline of the selected shape. The outline preferably has one or more children which each, in turn, have one or more children inside them. Once the tree is constructed, preferably a standard depth first search is used to stitch the polygons in the correct order from the center emanating outwards to ensure that the stitches are in an order that will sew well and produce the desired design. Preferably, between each subtree of polygons, the location of the next subtree is run by following the edges of the previously constructed Voronoi Diagram which ensures that connecting runs are in the interior of the selected shape. Up to this point in the presently preferred method of the present invention, it can be used to automatically generate chain stitches or chenille.

After this, assuming chenille is to be automatically generated, then, preferably, along these constructed polygons, spirals, like a spirograph, are placed, of varying size, in order to maintain a consistent filling of the area. Preferably the size of the spiral and the distance between the focal points from one to the next are the other determinant to the density of the fill. In placing the spirals, preferably prolate cycloids are generated. The stitches are then preferably placed along the spirals, at specified lengths, such as illustrated in FIG. 4.

For certain polygonal shapes, the concentric polygons leave certain "bald" spots on the shape that are not properly covered by the chenille stitching. In addition, for certain polygonal shapes, the stitching may be too dense or too coarse toward the center of the shape. In order to reduce this problem, the computer preferably determines a subset of the medial axis, that will be referred to hereinafter as the "spine" of the medial axis. The spine consists of those medial axis edges that define global axes of symmetry (see the aforementioned article entitled "Voronoi diagrams of Polygons: A Framework for Shape Representation"). The computer then preferably implements a pruning scheme in order to compute the spine. One such conventional pruning scheme which may preferably be employed is described in "Voronoi Skeletons: Theory and Applications," R. Ogniewicz and M. Ilg, IEEE Proc. Conf. on Vision and Pattern Recognition, Champaign, Ill., 1992, pp. 63-69, the content of which is incorporated herein by reference.

The spine of the medial axis is represented as a graph which is traversed in depth first order. For each edge of the Voronoi Diagram, the computer preferably determines prolate cycloids and places equal length stitches along the contour of the prolate cycloids. Edges of the concentric polygons that are within a predetermined distance from the spine are pruned, i.e., deleted to provide modified concentric polygons. This prevents having too dense an area of stitching near the center of the shape. The edges of the modified concentric polygon that remain are stitched as described above, i.e., the computer creates prolate cycloids for each segment and places equal length stitches along the cycloids, thereby minimizing the occurrence of any bald spots in the filling of the modified concentric polygon with the chenille type stitches.

Chain stitching is a necessary stitch around all chenille and, as shown and preferred in FIGS. 8A-8C, the presently preferred method of the present invention also enables chain stitches to be automatically generated. In this instance, preferably the same procedure as for generating chenille stitches is employed up through the sorting of the concentric polygons. Thereafter, however, rather than placing spirals along the polygons, chain stitches are placed on the perimeter of the offset or concentric polygons at a specified length. In this regard, if desired, an entire shape can be covered by chain stitches such as illustrated in FIG. 5. Thus, the chain stitching method of the present invention is not restricted to chenille and can be used in embroidery or any other concentric coverage of shapes.

In order to compute the loop-height of each spiro in the prolate cycloids being computed, the computer preferably prompts the user to input two parameters; namely, the stitch length, and the density (specified in stitches per square cm). The computer then preferably calculates the following parameters:

axisLineSpacing: the distance between two adjacent concentric polygons.

loopheight: the height of the spiro.

rollradius: the inner radius of the prolate cycloid.

penradius: the outer radius of the prolate cycloid.

The system then preferably computes these values using the following equations:

    SPIRO.sub.-- FACTOR=(7.0/3.0)*(4.0/5.0)*(3.0/4.0);

    loopHeight=100.0*2.0*P1*SPIRO.sub.-- FACTOR/((stitchLength/100.0)*density);

    rollRadius=loopHeight/12.0;

    lineSpacing=loopHeight*2.0/3.0;

    penRadius=rollRadius*6.0;2

It should be noted that the above described method of the present invention may be preferably carried out by conventionally programming the computer of the computer aided design system to carry out the above steps with reference to the aforementioned articles concerning the theory behind Voronoi Diuagrams and skeletons which the present invention employs. 

What is claimed is:
 1. In a method for automatically generating chain stitched stitch patterns in a computer aided design system comprising a computer means capable of generating stitch patterns for controlling a stitching apparatus in accordance with a selected chain stitch pattern generated by said computer means, wherein said chain stitched stitch patterns comprise stitch patterns having a polygon type shape and an associated fill density; the improvement comprising:selecting a stitch pattern for said computer means to generate for controlling said stitching apparatus, said selected stitch pattern having an associated polygon type shape having an outer edge; determining a Voronoi Diagram comprising Voronoi edges for said selected polygon type shape in said computer means; constructing a plurality of spaced apart polygon type shapes in said computer means which are concentric to said selected polygon type shape and extending from said outer edge to said Voronoi edges, said computer constructed polygon type shapes being spaced apart from an adjacent concentric polygon type shape by a predetermined distance comprising a determinant of the fill density associated with said selected polygon type shape; sorting said constructed polygon type shapes in said computer means in order for providing for proper sequencing and minimal jumping of said selected stitch pattern in said stitching apparatus from one part of said associated shape to another part of said associated shape; and generating a plurality of chain stitches in said computer means and placing said plurality of computer generated chain stitches in said stitching apparatus on the perimeter of at least one of said computer constructed concentric polygons at a predetermined length under control of said computer means; whereby said chain stitches are automatically generated from said selected stitch pattern.
 2. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 1 wherein said chain stitch placing step comprises the step of placing said plurality of chain stitches in said stitching apparatus on the perimeter of said plurality of constructed polygon type shapes at a predetermined length.
 3. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 2 wherein said chain stitch placing step comprises the step of providing said chain stitching in said stitching apparatus around said selected polygon shape for covering said selected stitch pattern with said chain stitches for filling said selected stitch pattern with said chain stitches.
 4. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 1 wherein said chain stitch placing step comprises the step of providing said chain stitching in said stitching apparatus around said selected polygon shape for covering said selected stitch pattern with said chain stitches for filling said selected stitch pattern with said chain stitches.
 5. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 4 wherein said selected stitch pattern is an embroidery pattern, said stitching apparatus comprising an embroidery machine, and said filling of said selected embroidery stitch pattern with said chain stitches provides a filled embroidery stitch pattern.
 6. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 1 wherein said selecting step comprises the step of creating a desired polygon type outer shape in said computer means to be converted into said chain stitched stitch pattern.
 7. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 6 wherein said creating step comprises the step of inputting said desired polygon type shape to said computer means in said computer aided design system.
 8. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 1 wherein said step of determining said Voronoi Diagram comprises the steps of creating rays in said computer means emanating in towards said selected polygon type shape from every corner of said selected shape that is less than 90 degrees, and constructing two rays in said computer means pointing in a direction normal to one of the edges of each corner having an interior angle greater than 90 degrees.
 9. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 8 wherein said ray creating step in said computer means comprises the step of constructing in said computer means a vector that bisects the angle of the corner for said corners of said selected shape that are less than 90 degrees.
 10. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 9 further comprising the step of tracing each ray to determine an ending point for the ray.
 11. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 10 wherein each ray is equidistant from two parent sites and has a starting point, and wherein the step of tracing the ray comprises determining the ending point of the ray by computing the nearest point to the starting point at which the ray is equidistant from 3 sites.
 12. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 1 wherein said step of constructing said plurality of spaced apart concentric polygon type shapes in said computer means comprises the step of, for each line segment in said shape, determining the endpoints of parallel line segments that are contained inside the Voronoi Diagram that are at a predetermined offset distance from each other.
 13. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 12 wherein said step of constructing said plurality of spaced apart concentric polygon type shapes in said computer means further comprises the step of, for each point site at a non-convex edge of the selected polygon type shape, the computer determining a set of parallel parabolic arcs that lie inside the Voronoi Diagram that are at predetermined offset distance from each other.
 14. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 13 wherein said step of constructing said plurality of spaced apart concentric polygon type shapes in said computer means further comprises the step of sweeping a line through said polygon type shape and computing in said computer means all the segments of all positions of said line that fall in the interior of said polygon type shape.
 15. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 14 wherein said step of constructing said plurality of spaced apart concentric polygon type shapes in said computer means further comprises the step of determining in said computer means for each of said edges which edges are adjacent to it for constructing said concentric polygon type shapes in said computer means.
 16. An improved method for automatically generating chain stitched stitch patterns in accordance with claim 1 wherein said step of constructing said plurality of spaced apart concentric polygon type shapes in said computer means comprises the step of, for all segments in said shape, constructing in said computer means a new polygon made up of those edges of said Voronoi Diagram that are closest to the edge being considered for each edge in said selected polygon type shape. 